NP-completeness of refutability by literal-once resolutionSZEIDER, Stefan.Lecture notes in computer science. 2001, pp 168-181, issn 0302-9743, isbn 3-540-42254-4Conference Paper

NEXPTIME-complete Description logics with concrete domainsLUTZ, Carsten.Lecture notes in computer science. 2001, pp 45-60, issn 0302-9743, isbn 3-540-42254-4Conference Paper

More on implicit syntaxLUTHER, Marko.Lecture notes in computer science. 2001, pp 386-400, issn 0302-9743, isbn 3-540-42254-4Conference Paper

A top-down procedure for disjunctive well-founded semanticsWANG, Kewen.Lecture notes in computer science. 2001, pp 305-317, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Upper bounds for standardizations and an applicationXI, H.Lecture notes in computer science. 1997, pp 335-348, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Algorithms, datastructures, and other issues in efficient automated deductionVORONKOV, Andrei.Lecture notes in computer science. 2001, pp 13-28, issn 0302-9743, isbn 3-540-42254-4Conference Paper

P.rex : An interactive proof explainerFIEDLER, Armin.Lecture notes in computer science. 2001, pp 416-420, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Computational logic and proof theory (Vienna, August 25-29, 1997)Gottlob, Georg; Leitsch, Alexander; Mundici, Daniele et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63385-5, VIII, 348 p, isbn 3-540-63385-5Conference Proceedings

Sketch-as-proofPREINING, N.Lecture notes in computer science. 1997, pp 264-277, issn 0302-9743, isbn 3-540-63385-5Conference Paper

A model-based completeness proof of extended narrowing and ResolutionSTUBER, Jürgen.Lecture notes in computer science. 2001, pp 195-210, issn 0302-9743, isbn 3-540-42254-4Conference Paper

A general method for using schematizations in automated deductionPELTIER, Nicolas.Lecture notes in computer science. 2001, pp 578-592, issn 0302-9743, isbn 3-540-42254-4Conference Paper

System abstract : E 0.61SCHULZ, Stephan.Lecture notes in computer science. 2001, pp 370-375, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Termination and reduction checking for higher-order logic programsPIENTKA, Brigitte.Lecture notes in computer science. 2001, pp 401-415, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Hilberticus : A tool deciding an elementary sublanguage of set theoryLÜCKE, Fjörg.Lecture notes in computer science. 2001, pp 690-695, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Deduction-based decision procedure for a clausal miniscoped fragment of FTLPLIUSKEVICIUS, Regimantas.Lecture notes in computer science. 2001, pp 107-120, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Resolution, inverse method and the sequent calculusTAMMET, T.Lecture notes in computer science. 1997, pp 65-83, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Subtyping over a latticeTIURYN, J.Lecture notes in computer science. 1997, pp 84-88, issn 0302-9743, isbn 3-540-63385-5Conference Paper

The undecidability of simultaneous rigid E-unification with two variablesVEANES, M.Lecture notes in computer science. 1997, pp 305-318, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Incremental closure of free variable tableauxGIESE, Martin.Lecture notes in computer science. 2001, pp 545-560, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Approximating dependency graphs using tree automata techniquesMIDDELDORP, Aart.Lecture notes in computer science. 2001, pp 593-610, issn 0302-9743, isbn 3-540-42254-4Conference Paper

The MODPROF Theorem ProverHAPPE, Jens.Lecture notes in computer science. 2001, pp 459-463, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Propositional quantification in intuitionistic logicPOŁACIK, T.Lecture notes in computer science. 1997, pp 255-263, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Translating set theoretical proofs into Type theoretical programsSETZER, A.Lecture notes in computer science. 1997, pp 278-289, issn 0302-9743, isbn 3-540-63385-5Conference Paper